The berth allocation problem in terminals with irregular layouts
نویسندگان
چکیده
منابع مشابه
Working Paper The berth allocation problem with mobile quay walls
The berth allocation problem (BAP), which de nes a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for e ciently operating a container port. In this paper we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled oating platforms, which encase ships moored at the immobile quay and provide additional quay ...
متن کاملGenetic Algorithm for Dynamic Berth Allocation Problem with Discrete Layout
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...
متن کاملSimulation-Optimization Models for the Dynamic Berth Allocation Problem
Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...
متن کاملTowards a Matheuristic Approach for the Berth Allocation Problem
The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programmi...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.07.019